Rounding error propagation in polynomial evaluation schemes
نویسندگان
چکیده
منابع مشابه
Considering Error Propagation in Stepwise Polynomial Regression
The selection of an optimal regression model comprising linear combinations of various integer powers of an independent variable (explanatory variables) is considered. The optimal model is defined as the most accurate (minimal variance) stable model, where all parameter estimates of the orthogonalized explanatory variables are significantly different from zero. The potential causes that limit t...
متن کاملError propagation assessment of enumerative coding schemes
Enumerative coding is an attractive algorithmic procedure for translating long source words into codewords and vice versa. The usage of long codewords makes it possible to approach a code rate which is as close as desired to Shannon’s noiseless capacity of the constrained channel. Enumerative encoding is prone to massive error propagation as a single bit error could ruin entire decoded words. T...
متن کاملA comparison of polynomial evaluation schemes
The goal of this paper is to analyze two polynomial evaluation schemes for multiple precision floating point arithmetic. Polynomials are used extensively in numerical computations (Taylor series for mathematical functions, root finding) but a rigorous bound of the error on the final result is seldom provided. We provide such an estimate for the two schemes and find how to reduce the number of o...
متن کاملError Propagation Assessment of Enumerative Coding Schemes Kees
2591 consisting of two four-state trellises. To this point, though, no new codes comparable to, for example, the rate 4=5 and the rate 8=9 MTR codes in [10] for the (1 0 D) (1 + D) 3 and (1 0 D) (1 + D) 4 channels have been found. For future work, an interesting research problem would be to relax the trellis-matching constraint to enlarge the constellations, thus obtaining higher-rate codes. Of...
متن کاملError Analysis for Polynomial Evaluation 791
A floating-point error analysis is given for the evaluation of a real polynomial at a real argument by Horner's scheme. A computable error bound is derived. It is observed that when a polynomial has coefficients of constant sign or of strictly alternating sign, one cannot expect better accuracy by reformulating the problem in terms of Chebyshev polynomials. Given that the real polynomial P{x) =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1979
ISSN: 0377-0427
DOI: 10.1016/0771-050x(79)90002-0